An Improved Upper Bound on the Number of Billiard Ball Collisions
نویسندگان
چکیده
We give a new upper bound $K_+$ on the number of totally elastic collisions $n$ hard spheres with equal radii and masses in $R^d$. Our satisfies $\log K_+ \leq c(d) n \log n$.
منابع مشابه
On trees attaining an upper bound on the total domination number
A total dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every vertex of $G$ has a neighbor in $D$. The total domination number of a graph $G$, denoted by $gamma_t(G)$, is~the minimum cardinality of a total dominating set of $G$. Chellali and Haynes [Total and paired-domination numbers of a tree, AKCE International ournal of Graphs and Combinatorics 1 (2004), 6...
متن کاملNon-smooth modelling of billiard- and superbilliard-ball collisions
A description of billiard-ball collisions using a ‘discontinuous’ model is presented considering a two-step situation corresponding to the ball–ball interaction followed by ball-supporting surface interaction. It is applied to the inelastic impact of a cue ball having arbitrary pivotment and ‘English’ spins against an object ball initially at rest. This formulation provides a simplified approxi...
متن کاملAn Upper Bound on the First Zagreb Index in Trees
In this paper we give sharp upper bounds on the Zagreb indices and characterize all trees achieving equality in these bounds. Also, we give lower bound on first Zagreb coindex of trees.
متن کاملAn Upper Bound on the Reduction Number of an Ideal
Let A be a commutative ring and I an ideal of A with a reduction Q. In this paper we give an upper bound on the reduction number of I with respect to Q, when a suitable family of ideals in A is given. As a corollary it follows that if some ideal J containing I satisfies J = QJ , then I = QI, where v denotes the number of generators of J/I as an A-module.
متن کاملA procedure for finding an improved upper bound on the number of optimal design points
Knowing an upper bound on the number of optimal design points greatly simplifies the search for an optimal design. Carathéodory’s Theorem is commonly used to identify an upper bound. However, the upper bound from Carathéodory’s Theorem is relative loose when there are three or more parameters in the model. In this paper, an alternative approach of finding a sharper upper bound for classical opt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Mathematical Physics
سال: 2022
ISSN: ['0010-3616', '1432-0916']
DOI: https://doi.org/10.1007/s00220-021-04278-6